Harmonic Symmetrization of Convex Sets and of Finsler Structures, with Applications to Hilbert Geometry
نویسندگان
چکیده
David Hilbert discovered in 1895 an important metric that is canonically associated to an arbitrary convex domain Ω in the Euclidean (or projective) space. This metric is known to be Finslerian, and the usual proof of this fact assumes a certain degree of smoothness of the boundary of Ω, and refers to a theorem by Busemann and Mayer that produces the norm of a tangent vector from the distance function. In this paper, we develop a new approach for the study of the Hilbert metric where no differentiability is assumed. The approach exhibits the Hilbert metric on a domain as a symmetrization of a natural weak metric, known as the Funk metric. The Funk metric is described as a tautological weak Finsler metric, in which the unit ball in each tangent space is naturally identified with the domain Ω itself. The Hilbert metric is then identified with the reversible tautological weak Finsler structure on Ω, and the unit ball of the Hilbert metric at each point is described as the harmonic symmetrization of the unit ball of the Funk metric. Properties of the Hilbert metric then follow from general properties of harmonic symmetrizations of weak Finsler structures. AMS Mathematics Subject Classification: preliminary : 58B20 ; secondary : 51K05 ; 51K10 ; 52A07 ; 52A20 ; 53B40 ; 53C60.
منابع مشابه
Strong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces
In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملA convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملRelative volume comparison theorems in Finsler geometry and their applications
We establish some relative volume comparison theorems for extremal volume forms of Finsler manifolds under suitable curvature bounds. As their applications, we obtain some results on curvature and topology of Finsler manifolds. Our results remove the usual assumption on S-curvature that is needed in the literature.
متن کاملVariational inequalities on Hilbert $C^*$-modules
We introduce variational inequality problems on Hilbert $C^*$-modules and we prove several existence results for variational inequalities defined on closed convex sets. Then relation between variational inequalities, $C^*$-valued metric projection and fixed point theory on Hilbert $C^*$-modules is studied.
متن کامل